Randomized fault-detecting leader election in a bi-directional ring
نویسنده
چکیده
This article presents a randomized algorithm for leader election which uses bi-directionality of an asynchronous ring to force a node to “commit” to a coin flip by sending it in both directions. The algorithm is fault-detecting in a strong sense: it works if and only if there is a connected segment of [n/21+ 1 non-faulty processors (n = ringsize). Faulty processors may do anything to disrupt the algorithm-ven communicate outside the ring and cooperate. The algorithm guarantees that each non-faulty processor in the segment either has probability l /n of being elected leader or will receive a fault message.
منابع مشابه
Formal Modeling and Analysis of Leader Election in MANETs
The modeling and analysis of mobile ad hoc networks (MANETs) pose non-trivial challenges to formal methods. Time, geometry, communication delays and failures, mobility, and uniand bidirectionality can interact in unforeseen ways that are hard to model and analyze by automatic formal methods. In this work we use rewriting logic and Real-Time Maude to address this challenge. We propose a composab...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based rings
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have bound on their id values The id values of processors in a ring whose size is N have to be inferior to N k The size of commu nication registers required by the algorithm is constant The algorithm stabilizes in k N time In DGS Dolev Gouda and Schneider have e...
متن کاملDesign and Implementation of a Secure Group Communication Protocol on a Fault Tolerant Ring
In this paper, we describe a secure group communication protocol for a fault-tolerant synchronous ring. Our protocol, named Secure Synchronous Ring Protocol (SSRP), integrates a secure group communication facility into an existing scalable, fault-tolerant ring protocol. SSRP is a hierarchical group communication protocol that employs Cliques GDH contributory key management protocol and Diffie-H...
متن کاملDesigning and Evaluating Fault-tolerant Leader Election Algorithms
Fault-tolerant leader election is a basic building block for dependable distributed computing, since it allows coordinating decisions among replicas such that they remain consistent. Indeed, several fault-tolerant agreement protocols rely on an eventual leader election service. This problem has been initially studied in crash-prone systems, and more recently in other failure scenarios, e.g., cr...
متن کاملFault Tolerant Leader Election in Distributed Systems
There are many distributed systems which use a leader in their logic. When such systems need to be fault tolerant and the current leader suffers a technical problem, it is necesary to apply a special algorithm in order to choose a new leader. In this paper I present a new fault tolerant algorithm which elects a new leader based on a random roulette wheel selection.
متن کامل